CHEBYSHEV POLYNOMIAL APPROXIMATION FOR ACTIVATION SIGMOID FUNCTION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Signal Processing via Chebyshev Polynomial Approximation

Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We...

متن کامل

Computable Function Representations Using Effective Chebyshev Polynomial

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Real Polynomial Chebyshev Approximation by the Carathiodory - Fejir Method

A new method is presented for near-best approximation of a real function F on [-r, r] by a polynomial of degree m. The method is derived by transplanting the given problem to the unit disk, then applying the Carath6odory-Fej6r theorem. The resulting near-best approximation is constructed from the principal eigenvalue and eigenvector of a Hankel matrix of Chebyshev coefficients of F. It is well ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Network World

سال: 2012

ISSN: 1210-0552,2336-4335

DOI: 10.14311/nnw.2012.22.023